On a Class of Preconditioners for Interior Point Methods
نویسندگان
چکیده
In most primal-dual interior point methods, a sequence of weighted normal equations are solved, where the only change from one problem to the next are the weights and the right hand side. Solving the normal equations alternating between a direct method and an iterative method was introduced in Wang and O'Leary 11]. A class of preconditioners based on a low-rank correction of a Cholesky factorization of a weighted normal equation coeecient matrix was used in 11] and the low-rank correction was based on the diierence of the weights. In Baryamureeba, Steihaug and Zhang 2] it was shown that the low-rank correction should be based on the ratios of the weights to reduce the condition number. The purpose of this paper is to compare the approach in forming the low-rank preconditioners in 2] with the approach by Wang and O'Leary 11, 10]. The theory and numerical testing strongly support the approach by Baryamureeba, Steihaug and Zhang 2].
منابع مشابه
Inexact Jacobian Constraint Preconditioners in Optimization
In this paper we analyze a class of approximate constraint preconditioners in the acceleration of Krylov subspace methods fot the solution of reduced Newton systems arising in optimization with interior point methods. We propose a dynamic sparsification of the Jacobian matrix at every stage of the interior point method. Spectral analysis of the preconditioned matrix is performed and bounds on i...
متن کاملPreconditioning Indefinite Systems in Interior-Point Methods for quadratic optimization
A new class of preconditioners is proposed for the iterative solution of symmetric indefinite systems arising from interior-point methods. The use of logarithmic barriers in interior point methods causes unavoidable ill-conditioning of linear systems and, hence, iterative methods fail to provide sufficient accuracy unless appropriately preconditioned. Now we introduce two types of preconditione...
متن کاملA Study of Preconditioners for Network Interior Point Methods
ABSTRACT. We study and compare preconditioners available for network interior point methods. We derive upper bounds for the condition number of the preconditioned matrices used in the solution of systems of linear equations defining the algorithm search directions. The preconditioners are tested using PDNET, a state-of-the-art interior point code for the minimum cost network flow problem. A com...
متن کاملUpdating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; ne...
متن کاملA new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
A Class of Splitting Preconditioners for the iterative solution of Linear Systems arising from Interior Point Methods for Linear Programming Problems needs to find a base by a sophisticated process based in a lying rectangular LU factorization, that involves reordering columns many times until certain conditions are satisfied. At the same time, it is necessary to prevent excessive fill-in in L ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007